Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
نویسنده
چکیده
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behavior of evolutionary algorithms with nite search spaces and discrete time scale. Results on evolutionary algorithms beyond nite space and discrete time are also presented but with reduced elaboration.
منابع مشابه
Convergence Analysis of Quantum Genetic Algorithm
It is an important and a complicated task to investigate the convergence of a new genetic algorithm based on quantum mechanics concepts including qubits and superposition of states, namely Quantum Genetic Algorithm, in the field of evolutionary computation. This paper analyzes convergence property of quantum genetic algorithm which uses its special quantum operator instead of canonical operator...
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملToward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP
In the field of evolutionary algorithms (EAs), many operators have been introduced for the traveling salesman problem. Most encoding schemes have various restrictions that often result in a loss of information contained in problem instances. We suggest a new chromosomal encoding scheme that pursues minimal information loss and a crossover scheme with minimal restriction for the two-dimensional ...
متن کاملTowards an analytic framework for analysing the computation time of evolutionary algorithms
In spite of many applications of evolutionary algorithms in optimisation, theoretical results on the computation time and time complexity of evolutionary algorithms on different optimisation problems are relatively few. It is still unclear when an evolutionary algorithm is expected to solve an optimisation problem efficiently or otherwise. This paper gives a general analytic framework for analy...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 35 شماره
صفحات -
تاریخ انتشار 1998